H . Comon − Lundh and V . Shmatikov Constraint solving
نویسنده
چکیده
We present decidability results for the verification ofcryptographic protocols in the presence of equational the-ories corresponding to xor and Abelian groups. Since theperfect cryptography assumption is unrealistic for crypto-graphic primitives with visible algebraic properties such asxor, we extend the conventional Dolev-Yao model by per-mitting the intruder to exploit these properties. We showthat the reachability problem is NP-complete for the ex-tended intruder theories in the cases of xor and Abeliangroups. This result follows from a normal proof theorem.Then, we show how to lift this result in the xor case: weconsider a symbolic constraint system expressing the reach-ability (e.g., secrecy) problem for a finite number of ses-sions. We prove that such constraint system is decidable,relying in particular on an extension of combination algo-rithms for unification procedures. As a corollary, this en-ables automatic symbolic verification of cryptographic pro-tocols employing xor for a fixed number of sessions.
منابع مشابه
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties such as xor, we extend the conventional Dolev-Yao model by permitting the intruder to exploit these properties. We sh...
متن کاملCompletion of Rewrite Systems with Membership Constraints
We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...
متن کاملCompletion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving
We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003